Enhanced signal integrity and communication utilizing optimized code table signaling

ABSTRACT

In various embodiments, a computer-implemented method for optimized data transfer utilizing optimized code table signaling is disclosed. In one embodiment, a computer-implemented method comprises receiving, by a processor, a digital bit stream and transforming, by the processor, the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises at least one of a gateway channel, a composite channel, or a data channel, and any combination thereof. The computer-implemented method further comprises providing, by the processor, the encoded digital bit stream to a transmission system for transmission and establishing, by the processor, signal integrity by utilizing pre-coordinated, pre-distributed information to limit the transmission to an intended sender-receiver pair. The intended sender-receiver pair comprises the pre-coordinated, pre-distributed information.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit, under 35 U.S.C. §119(e), ofU.S. Provisional Application Ser. No. 61/862,745, filed Aug. 6, 2013,the disclosure of which is incorporated herein by reference in itsentirety.

TECHNICAL FIELD

The disclosure generally relates to the field of communication systems,particularly to a data communication system utilizing optimized codetable signaling.

BACKGROUND

Various data communication schemes are available for radio communicationsystems. Modulation techniques (e.g., analog or digital modulation) maybe utilized in such communication schemes. In addition, encoding anddecoding processes may also be utilized to improve the signal integrityof the data being communicated.

SUMMARY

The present disclosure is directed to data communication systems andmethods. In various embodiments, the method applies optimized code tablesignaling (OCTS) to a digital data stream for the purpose of enhancingsignal integrity and communication, adapting to a digital communicationsnetwork, and operating independent of industry and regulatory standardsfor input digital bit stream and transmission methods.

A further embodiment comprises applying OCTS to an analog bit streamthat has been digitized for the purpose of enhancing signal integrityand communication of the bit stream, adapting to a communications methodselected for transmission of digitized analog signals, and operatingindependent of industry and regulatory standards for input digitizedanalog signal stream and transmission methods.

It is to be understood that both the foregoing general description andthe following detailed description are exemplary and explanatory onlyand are not necessarily restrictive of the present disclosure. Theaccompanying drawings, which are incorporated in and constitute a partof the specification, illustrate subject matter of the disclosure.Together, the descriptions and the drawings serve to explain theprinciples of the disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the embodiments described herein are set forthwith particularity in the appended claims. The embodiments, however,both as to organization and methods of operation may be betterunderstood by reference to the following description, taken inconjunction with the accompanying drawings as follows:

FIG. 1 illustrates a block diagram of one embodiment of a datacommunication system for transmitting data from one or more senders toone or more receivers.

FIG. 2 illustrates a block diagram of one embodiment of datacommunication system for transmitting data.

FIG. 3 illustrates one embodiment of an OCTS process.

FIG. 4 illustrates one embodiment of an OCTS table.

FIG. 5 illustrates one embodiment of an OCTS-expanded table.

FIG. 6 illustrates one embodiment of an OCTS-expanded process includingan interleaved data vector.

FIG. 7 illustrates one embodiment of an OCTS-expanded table comprising adesignated use for each data type.

FIG. 8 illustrates one embodiment of interleaved gateway channel andcomposite channel vectors.

FIG. 9 illustrates one embodiment of an OCTS-expanded code tableservicing an m-element binary input vector.

FIG. 10 illustrates one embodiment of an OCTS-expanded tabletransmission mode.

FIG. 11 illustrates one embodiment of an OCTS-expanded table receivemode.

FIG. 12 illustrates one embodiment of an OCTS-expanded gateway codetable and block.

FIG. 13 illustrates one embodiment of the symbol, frame, and blockrelationship within a two-message block set.

FIG. 14 illustrates one embodiment of a computing device which can beused in one embodiment of the systems and methods for network monitoringand analytics.

DETAILED DESCRIPTION

Reference will now be made in detail to several embodiments, includingembodiments showing example implementations of systems and methods forOCTS-expanded data communications. Wherever practicable similar or likereference numbers may be used in the figures and may indicate similar orlike functionality. The figures depict example embodiments of thedisclosed systems and/or methods of use for purposes of illustrationonly. One skilled in the art will readily recognize from the followingdescription that alternative example embodiments of the structures andmethods illustrated herein may be employed without departing from theprinciples described herein.

FIG. 1 illustrates one embodiment of an Optimized Code Table Signaling(OCTS) process. The OCTS process provides encoding of binary inputs tomulti-valued vectors that are presented to the modulator andtransmitter, and provides the reverse process of converting the receivedmulti-value vector to a binary output vector. By judicious choice of theOCTS table, the parameters of Bit Error Rate (“BER”), realized datathroughput, bit energy, signal range, and signal integrity may bemanaged dynamically to provide enhanced signal integrity andcommunication. OCTS is described in U.S. Pat. No. 8,320,473, issued onNov. 27, 2012, and entitled “Data Communication System UtilizingOptimized Code Table Signaling,” which is hereby incorporated byreference in its entirety. Extension to OCTS are described in U.S.patent application Ser. No. 14/062,535, filed on Oct. 24, 2013, entitled“OPTIMIZED DATA TRANSFER UTILIZING OPTIMIZED CODE TABLE SIGNALING,”which is hereby incorporated by reference in its entirety.

FIG. 1 shows a block diagram illustrating steps performed by a datacommunication system/method 1000 implementing OCTS. The datacommunication system 1000 is utilized for transmitting data from one ormore senders 1002 to one or more receivers 1010. The data communicationsystem 1000 is configured to utilize the mapping of a binary bit streamto real-valued vectors, where the mapping functions are determined basedon the characteristics/properties of the communication path/environment.

In one embodiment, upon receiving data from a sender 1002, step 1004transforms (encodes) the received data into a vector of real numbers(which may be referred to as a real-valued data vector). For example,each n-bit binary word may be transformed into a set of m real-valuednumbers. The transformation is calculated in real-time for each binaryword based on the mapping function, or performed as a lookup in apre-computed table. For example, in one embodiment, Trellis codedModulation (TCM) is utilized for transforming asequence of n-bit binarywords into a sequence of m real-valued numbers based on the pre-computedtable.

The number (m) of real-valued numbers utilized to represent an n-bitbinary word may vary based on the properties of the communicationpath/environment. For example, in one embodiment, fewer than 6real-valued numbers are utilized to represent a 6-bit binary word in aless noisy environment. In another embodiment comprising a noisyenvironment, a 6-bit binary word may be transformed into a set of 6 (ormore) real-valued numbers. Those skilled in the art will understand thata small m value (the number of real-valued numbers used to represent ann-bit binary word) increases transmission capacity, while a larger mvalue provides better performance in a noisy environment. The specificvalues of n and m may be determined base on one or more properties ofthe communication environment, such as, for example, noise level, biterror rate, signal integrity, and/or other properties.

A transmitter 1006 transmits the transformed real-value data vector to areceive side. Standard communication mechanism, such as, for example,radio communication technologies comprising analog and/or digital moduleand/or spread spectrum techniques, may be utilized for the transmission.For example, in one embodiment, Quadrature Amplitude Modulation (QAM) isutilized for transmission of the transformed real-value data vector fromthe sender side to the receiver side.

Upon receipt of the real-valued data vector on the receiver side, thereceived real-valued data vector is transformed (decoded) 1008 into thecomputer-readable format originally sent by the sender 1002. In oneembodiment, the decoding process 1008 is performed as a table lookup foreach set of m real-valued numbers to locate the n-bit binary wordrepresented by the given set of m real-valued numbers. For example, foreach set of m real-valued numbers, the decoding process 1008 locates anelement in the lookup table that has the smallest Euclidian distanceaway from this set of m real-valued numbers. Thus, the n-bit binary wordthat corresponds to this element in the lookup table is the n-bit binaryword represented by the set of m real-valued numbers.

Once the transformation 1008 of the real-valued data vector into datarepresented in a computer readable-medium format is completed, thecomputer-readable data is transmitted to the receiver 1010. It will beappreciated that additional signal integrity is provided by transmittingthe encoded real-valued data vectors instead of the original binary datastream. Since the transformation table (or code table) is not sharedwith a third party, decoding of the intercepted real-valued data vector(by the third party) into the format originally sent by the sender maybe prevented and/or deferred. In some embodiments, the sender 1002 andthe receiver 1010 both comprise a pool of potential code tables suitablefor performing the encoding and decoding. The sender 1002 informs thereceiver 1010 of the specific code table utilized for encoding via atable identifier, such as, for example, acknowledging a table identifieras part of a handshake process and/or sending the identifier as part ofthe data transmission. The table identifier may not be meaningful to thethird party intercepting the transmission.

In some embodiments, the performance of the data communication system1000 is determined by the attributes of the code tables, which may beoptimized based on the properties of the communication environment. Thecode tables may not be unique for mapping an n-bit binary word to a setof real-valued numbers. In one embodiment, the selection criteria for asuitable code table comprises: 1) having a maximum distance between thedata vectors while maintaining the maximum power in the data vectors andusing the same dynamic range within each column; and 2) providing anacceptable encoding and decoding performance, for example, above apredetermined threshold.

FIG. 2 illustrates a block diagram of a communication system 1100. Thedata communication system 1100 may comprise: an input module 1102 forobtaining a data vector to be communicated; a code table selectingmodule 1104 for selecting a code table configured to facilitating saiddata communication; a vector selecting module 1106 for selecting avector of real numbers representative of said data vector from said codetable, for example, utilizing Trellis Coded Modulation; and atransmitter 1108 for transmitting the vector of real numbers to areceiver. The vector of real numbers is transformed, upon reception,into a best corresponding vector by utilizing the code table aspreviously described.

In one embodiment, the code table selecting module 1104 comprises adetermining module 1110 for determining at least one of a communicationcharacteristic of a communication environment, a desired level of signalintegrity, a desired data throughput level, or any combination thereof.The code table selecting module 1104 selects the code table at leastpartially based upon at least one of said communication characteristicof the communication environment, desired level of signal integrity,desired data throughput level, or any combination thereof.

In some embodiments, the code table selecting module 1104 includes atable generating module 1112 for creating a plurality of candidate codetables, each of the plurality of candidate code tables havingreal-valued data entries. The code table selecting module 1104 selectsthe code table from the plurality of candidate code tables based on anevaluation criterion. For example, in one embodiment, the evaluationcriterion is based on at least one characteristic of the communicationenvironment, such as, for example, noise level, bit error rate, signalintegrity, and/or other properties. In another embodiment, theevaluation criterion comprises a minimum separation distance for a givencandidate code table.

In some embodiments, the code table selecting module 1104 comprises aselecting module 1114 for selecting a code table from a set ofpreconfigured code tables. Each preconfigured code table of the set ofpreconfigured code tables is associated with a performance metric tofacilitate the selection process. Once a selection is made, acoordinating module 1116 coordinates the code table selected with atleast one receiver.

In some embodiments, the data communication system 1100 comprises anevaluating module 1118 for evaluating a signal integrity metric of thecode table. A determining module 1120 is configured to determine whetherthe signal integrity can be improved if the current code table isreplaced with a new code table. If the signal integrity can be improved,a replacing module 1122 replaces the current code table with the newcode table, and the new code table is utilized for subsequent datacommunications.

As previously mentioned, the receiver is configured for transforming thevector of real numbers received into a best corresponding vector byutilizing the code table. In one embodiment, the receiver comprises: avector generating module 1124 for creating a set of candidates for thebest corresponding vector; an associating module 1126 for associatingeach candidate of the set of candidates with a confidence value, theconfidence value for each candidate is determined based on a separationdistance between the candidate and the vector of real numbers calculatedutilizing the code table; and a transforming module 1128 fortransforming the vector of real numbers into the candidate with the bestconfidence value. In some embodiments, the receiver comprises a storagedevice configured for storing the best corresponding vector.

In some embodiments, code table generation algorithms are driven by aseed value passed into a pseudorandom number generator. By using arandom number generator that creates an identical string of pseudorandomnumbers given an identical seed, the code table generation algorithmswill generate an identical code table given an identical seed. A codetable may be identified by a unique identifier within a naming schemeand/or by a seed value. In some embodiments, the code table algorithmsrequire two or more seed values, each for unique functions within thecode table generation algorithm. When multiple seed values are used, anexhaustive search of a code table space driven by creating an exhaustivelist of code tables becomes prohibitively complex. In some embodiments,code table generation comprises a three-step process, consisting oftable creation, table evaluation, and table partitioning.

In some embodiments, a full set of code table output vectors is referredto as a code table signal constellation. Given a pair of n-elementoutput vectors x=(x₁, x₂, . . . , x_(n)) and y=(y₁, y₂, . . . , y_(n)),the mean free Euclidian distance (MFED) between vectors x and y is givenby the equation:

${M\; F\; E\; {D\left( {x,y} \right)}} = \sqrt{\sum\limits_{i = 1}^{n}\; \left( {x_{i} - y_{i}} \right)^{2}}$

The first order driver of the noise rejection properties of a code tableis the minimum MFED (min MFED) across all output vector pairs. Given twocode tables, the code table with the largest minimum MFED can bepredicted to have the fewest errors given identical signal to noiseratio (SNR) environments. In some embodiments, the minimum MFED servesas a table metric. In embodiments comprising sparsely populated tables(q^(n)>>2^(m)), the minimum MFED provides a useful metric. Inembodiments comprising fully populated tables, the minimum MFED may beconstant from table to table and therefore does not provide a usefulmetric.

In some embodiments comprising sparsely populated code tables, a tablecreation process generates a search algorithm to generate candidate codetables and to evaluate each of the candidate code tables with a codetable metric. For example, in one embodiment, if a table is verysparsely populated, a table generator spreads the signal constellationapart to generate better candidates as compared to a signalconstellation with a more uniform spread. In another embodimentcomprising a fully populated code table, the minimum MFED may beidentical in all cases. In this embodiment, the table generator isconfigured to maintain mapping from a single random number seed to aspecific and repeatedly generated code table.

FIG. 3 illustrates one embodiment of an OCTS information flow. An analoginput is converted 4 to a digital bit stream. A digital frame andadditional error control coding (ECC) 6 is applied to the digital bitstream. A binary input vector is provided to an OCTS table lookup 8. TheOCTS table lookup 8 produces a multi-valued output vector, which isprovided for modulation and transmission 10. The modulated signal istransmitted over a radiofrequency channel and is received and ademodulated 12 at a destination. The demodulated multi-valued outputvector is provided for reconstruction of the bit stream 16. In someembodiments, a digital output is provided. In other embodiments, thedigital bit stream is converted 18 into an analog output. Themulti-valued output vectors that comprise the output of the OCTS tablelookup and the input to the reverse OCTS table lookup in FIG. 1 maycomprise binary vectors in and out of a conventional digitalcommunications system.

An OCTS-expanded process provides the means to manage many of the tasksof OCTS and expands the utility of OCTS as an industry-standardsagnostic interface to an existing digital communications system. In someembodiments, an OCTS-expanded table comprises an addition of a column tothe OCTS table indicating the expanded use of each encoded vector. FIG.4 illustrates one embodiment of a standard OCTS table. FIG. 5illustrates one embodiment of an OCTS-expanded table comprising anadditional column. In some embodiments, one or more internalOCTS-expanded control channels are included for the OCTS-expandedprocess. As illustrated in FIG. 4, a traditional OCTS table 20 comprisesone or more OCTS encoded vectors 22. The OCTS-expanded table 120,illustrated in FIG. 5, comprises one or more OCTS encoded vectors 122and further comprises a use column 124. The use column 124 identifiesthe use of a vector within the OCTS-expanded table 120.

In some embodiments, OCTS-expanded processing requires two independentchannels, denoted as the Gateway Channel and the Composite Channel. TheGateway Channel allows a member user into a protected communicationsystem, limited to the specific send and recipient that havepre-coordinated and pre-distributed information and the CompositeChannel provides message and control functions. Each channel requiresits own code table, denoted as the Gateway Code Table and the CompositeCode Table. In some embodiments, the encoded Gateway Channel outputvectors are interleaved with the encoded Composite Channel outputvectors into a single pipe. The interleaving provides an additionalmeasure of complexity to the signal stream that may be used foradditional functions beyond enhanced signal integrity and communication.

In some embodiments, the Gateway Channel establishes signal integrity byvirtue of the use of pre-distributed information, such as, for example,pre-coordinated information and message manipulation functions. TheGateway Channel provides the signal integrity function and identifiesthe current Composite Channel OCTS configuration. The Gateway Channelmay provide the function and configuration by for example, a multi-partmessage comprises a first part to provide the signal integrity and asecond part to identify the current Composite Channel configuration. TheGateway Channel maintains signal integrity of the transmission using thepre-distributed information. For example, in one embodiment, the GatewayChannel provides the means for uniquely coded acknowledgement from therecipient to the sender and maintains signal integrity by verifyingreceipt by the intended recipient. In some embodiments, uniqueformatting of the transmission limits the transmission to the intendedsender-receiver pair. For example, the multi-part message may compriseunique formatting known only to the sender-receiver pair which preventsinterception or decoding of the transmission by receivers outside of thesender-receiver pair.

In some embodiments, a data vector is interleaved as illustrated in FIG.6. A binary input data vector 226 is provided to an OCTS-expandedencoder 230. The OCTS-expanded encoder 230 applies an OCTS-expandedtable to the binary input data vector 226. A gateway encoder 228 encodesa gateway channel utilizing a second OCTS-expanded table. The datastream for the OCTS-expanded encoder 230 and the gateway encoder 228 areinterleaved 234 into the same output stream to produce a multi-valuedoutput composite vector 236, which is transmitted over a communicationchannel. In some embodiments, the communication channel may comprise anRF communication channel. In other embodiments, the communicationchannel may comprise any bound or unbound communication channel. Aninternal OCTS-expanded controller 232 is configured to control both theOCTS-expanded encoder 230 and the gateway encoder 228.

In operation, signal integrity is established and maintained through theuse of encoding provided by the use of OCTS. In some embodiments, thetransmitter encodes the digital bit stream intended for transmissionusing a pre-distributed Gateway Channel code table to generate anOCTS-expanded message. The OCTS-expanded encoded message comprisesGateway Channel information and Composite Channel information. TheGateway Channel information may be distinguishable by, for example,location in the interleaved stream (referred to as an interleavingschedule), by use of the output vectors unique to the Gateway Channel(referred to as table partitioning), and/or other suitabledistinguishing techniques. The Gateway Channel provides an encoded bitstream to carry information required to decode the Composite Channelinformation.

In some embodiments, pre-distributed information provides theinformation necessary to decode the Gateway Channel information. Thedecoded Gateway Channel information identifies the current OCTS-expandedcode table in use by the Composite Channel and therefore allows accessto the Composite Channel information. The pre-distribtued informationmay comprise, for example, the Gateway Channel OCTS code tableidentifier, the interleave schedule and/or the table partitioninginformation for decoding the interleaved Gateway Channel and CompositeChannel information, additional coding used to verify the correctreceipt of the Gateway Channel information, such as, for example, achecksum or masking function, and/or any other information necessary fordecoding and identifying the Gateway Channel information.

In some embodiments, the Composite Channel comprises control data usedto authenticate a transmitter and/or a receiver, adjust the code tablefor optimizing data transfer rate, changing the code table to enhancewhere in the code table the data is located for maintaining signalintegrity, changing the interleaving of the signal data and controldata, and/or additional information. The changes made by the controldata in the Composite Channel may require a full transmit/receive cycleto properly propagate within the system to affect a shift in the codetable in use. By pre-distributing the interleave schedule and/or thetable partitioning information, the OCTS-expanded transmission can onlybe decoded by a receiver in possession of the initial code tabledefinitions and which knows the method of how subsequent code tablechanges are encoded within the digital bit stream. Signal integrity ismaintained and protected, as the sender has an increased assurance thatonly the intended recipient can decode the transmission and that thereceiver will be able to identify the digital bit stream within thetransmission even at reduced transmission quality.

In various embodiments, a channel is defined as a specifically purposedstream of encoded information. FIG. 7 illustrates one embodiment of anOCTS-expanded table comprising a use column 322 denoting the use typefor each vector within the OCTS-expanded table 320. Each data type ofthe Use Column of an OCTS-expanded encoded vector has a designated use.In some embodiments, control data for the Gateway Channel is used forgateway and code table identification and is denoted “C1.” Control datafor the Gateway Channel may be further used for Receive and Transmit(RX/TX) coordination. In some embodiments, additional use column datafor the Gateway Channel comprising Error Control Coding (ECC)information, denoted as “E1”, and additional data, denoted as “D1,” maybe included in the OCTS-expanded table 320. In some embodiments, thecomposite channel is used for combination data, RX/TX coordinationand/or other possible control information. Control data for RX/TXcoordination in the Composite Channel is denoted “C2”, Error ControlCoding information is denoted as “E2”, and additional data may beincluded and is denoted as “D2.” In some embodiments, additional usesmay exist for the Composite Channel and may be used for growth andexpansion of the OCTS-expanded process. In one embodiment, theadditional Composite Channel data defines the function and performanceof OCTS-expanded Quality of Service processing.

In various embodiments, a pipe comprises the full set of channels for anRX/TX pair. A symbol comprises one element of an encoded output vector,a frame comprises the full element set of an encoded output vector, anda block comprises the full frame set of encoded vectors included in amessage block. Symbol synchronization comprises the identification ofthe leading edge of single symbol. Frame synchronization comprises theidentification of the initial symbol within a frame. Blocksynchronization comprises the identification of the initial frame withina message block.

In some embodiments, the interleaved encoded multi-valued output vectoris created using a mask to identify the locations within the CompositeChannel symbol stream to interleave with the Gateway Channel symbolstream. FIG. 8 illustrates one embodiment of a composite channel codeblock 438, a gateway channel code block 440, a pipe 442 comprising theinterleaved composite channel code block 438 and the gateway channelcode block 440, and a mask 444 indicating the interleave pattern of thepipe 442. In the illustrated embodiment, the gateway channel block 440length is dissimilar to the composite code block 438 length, and bothare dissimilar to the Interleaved Code Block 442 length. Theinterleaving of the gateway channel 440 and the composite channel 438with frame and message synchronization requires symbol synchronization.In some embodiments, the interleaving process sifts the symbols throughthe de-interleave function. This is detailed in Table 1, and allows fullmessage transmission through the Composite Channel.

FIG. 9 illustrates one embodiment of an OCTS-expanded Code Table,servicing an m-element binary input vector, and generating an n-elementmulti-value output vector. The OCTS-expanded code table comprises aplurality of code table partitions. Code table partitions comprise thesections of the code table specifically assigned to a single channel.The code table illustrated in FIG. 9 is partitioned to encode additionaldata D1 and error control coding E1. In some embodiments, tableparitioning provides increased minimum MFED within each partition andimproves the partition noise rejection properties.

In some embodiments, a number q of symbol elements is available for eachelement of the output vector. For example, in the case of MultipleFrequency Key Shifting with forty one unique tones, q is equal to 41.The number of binary inputs comprises 2^(m), where m is the number ofelements in the binary input vector, and the total number of possibleoutput vectors is q^(n), where n is the number of elements in theencoded output vector. For example, the OCTS-expanded table 520illustrated in FIG. 7 may be used to encode a 16 bit input vector. Thenumber of unique binary inputs is 2¹⁶=65,536, and the number of uniquemulti-valued output vectors is 41³=68,921. The OCTS-expanded Code Tableassociated with this input/output pairing is an array of dimension(68921, 3). In this example, the D1 partition of the OCTS-expanded CodeTable comprises the first 65,536 rows, leaving 68,921−65,536=3,385 rowsto encode 3,385 C1 and E1 vectors.

In various embodiments, an OCTS-expanded process can transmit andreceive into an existing digital communications system to integraterobust control features into the digital data stream. FIG. 10illustrates one embodiment of an OCTS-expanded process integrated into adigital communications system. In this embodiment, a conventionaldigital bit stream 650 is converted to a composite multi-valued stream,including data, control, and additional error control codinginformation. The digital bit stream 650 is provided to an input buffer652. The input buffer 652 passes the digital bit stream 650 to an errorcontrol coding process 654. The digital bit stream 650 and the errorcontrol coding 654 stream are provided to a multiplexer 656 which iscoupled to an input vector mapper 658. The input vector mapper 658 mapsthe output of the multiplexer 656 to an OCTS-expanded table. Thecomposite channel signal coding 660 process encodes mapped vectors basedon a table stored by the composite table manager 668 and the tablelibrary manager 666. The encoded data is passed to an interleaver 676 tointerleave the data with a gateway channel stream. The gateway channelstream is generated by a transmit controller 662 coupled to a gatewaychannel formatter 664. The gateway channel formatter 664 providesgateway channel data to a gateway channel mask 670, which in turn passesthe data to a gateway channel signal coding 674 process for encoding thegateway channel data. The encoded gateway channel data is provided tothe interleave signal processor 676 and is interleaved with thecomposite channel data provided by the composite channel signal coding660 process. The interleaved signal is provided to an input buffer 678and then to the transmission medium 680. In some embodiments, the outputof the OCTS-expanded processing transmit module of the digitalcommunications system is one-to-one, that is, a given input to theOCTS-expanded processing transmit module always results in the sameoutput, and the output is unique to the given input.

FIG. 11 illustrates one embodiment of a receive mode of a digitalcommunications system with an integrated OCTS-expanded process. In oneembodiment, a composite multi-valued stream is converted to itsconstituent data, control, and error control coding channels. Thedecoded binary output data vectors are then passed along to be processedinto a digital bit stream. The receive mode of the digitalcommunications system is generally the reverse of the transmit mode,illustrated in FIG. 10. A multi-valued data stream is received from atransmission medium 780 and passed to an input buffer 778. The inputbuffer is coupled to a de-interleave signal processor 786 configured tode-interleave the received multi-valued data stream. The compositesignal portion of the multi-valued data stream is provided to acomposite channel signal coding 760 process for decoding. The compositechannel signal coding 760 process utilizes an OCTS-expanded table todecode the received composite channel data. The decoded data is providedto an input vector mapper 758 to un-map the decoded data and provide adigital data stream. The output of the input vector mapper 758 isde-multiplexed into a data stream and an error correcting coding stream,which are both provided to an ECC coder 754. The data stream is errorcorrected and provided to an input buffer 752, which provides the datastream to a digital bit stream source (or destination) 750.

After being de-interleaved, the gateway channel is provided to a gatewaychannel signal coding 774 block to decode the gateway channel datathrough an OCTS-expanded table. The output of the gateway channel signalcoding 774 block is provided to a gateway channel mask 770 block toremove the mask from the gateway channel data. The de-masked gatewaychannel data is provided to a gateway channel formatter 764, whichremoves previously added formatting from the gateway channel data, andprovides the gateway channel data to a receive controller 762.

In some embodiments, the gateway code table and message blocks encodeand decode the composite code table identifier and provide confidence inthe composite code table identifier's correct decoding. In oneembodiment, an appropriate number of seeds for pseudorandom numbergenerators are used by the receive function to uniquely generate theComposite Code Table. Multiple methods may be used to establish theGateway Code Table and Message Blocks, such as, for example, bitposition partitioning, table partitioning, or a combination of the twotechniques.

In Bit Position Partitioning, both the transmitter and receiver know thelocation of the encoded bits. Detection of the transmitted message isavailable to the receiver based on knowledge of the position of theencoded message. An appropriate number of seeds are used to generate thepseudorandom numbers for the unique encoding.

With table partitioning, the partitions can be allocated to increase theMean Free Euclidian Distance (MFED) between elements of the partition byassigning encoded elements with the smallest MFED to differentpartitions. This increases the MFED within a partition, thus increasingnoise rejection properties in the case where a received signal can beidentified as a member of a specific partition.

With the use of table partitioning alone, the gateway channelinformation can be encoded using the gateway channel's partitionelements without the use of bit position partitioning foridentification. With bit position partitioning, the process ofsynchronizing against the first element of a message block can beachieved by recognizing the position of the gateway channel informationwithin the block, and stepping back in bit position with this knownoffset. In table partitioning, the gateway channel information mustcarry this offset within its encoding, since the offset from thereceived Gateway Channel bits and the lead bit of a message block canvary. FIG. 12 illustrates one embodiment of a gateway code table andblock configured for table partitioning. As illustrated in FIG. 12, theOCTS-expanded encoded vector for the gateway channel comprises theoffset within the channel frames 838.

FIG. 13 illustrates one embodiment of a symbol 888, frame 886, and block884 relationship within a two-message block set 882. In the illustratedembodiment, both frames 886 and blocks 884 begin on a symbol 888boundary. In order to perform block message processing, the specificsymbol that begins a block must be identified by the OCTS-expandedprocess.

TABLE 1 Step-by-Step Process for message transmit and receiveStep-by-Step Process Preparation Distribute the necessary sharedinformation to the subscriber Gateway Table Code identifier RFSpecifics: Frequency, BW, modulation, digital encoding methodInterleaving mask and block length Signal This is a receiver anddemodulator function. Acquisition The decoding process begins with theidentification of Symbol symbols synchroniza- tion De- SearchInterleaved message blocks by performing the interleaving maskingfunction against each possible initial symbol Evaluate each candidatemessage block using the Gateway Code Table and the Gateway Blockdefinition associated with FIG. 7 above. De-interleaving is successfulwhen the seed checksums are per the predefined encode. Use the contentsof the Gateway Channel Frame to determine the symbol offset to align theComposite Channel Composite Align the Composite Channel message blockand begin Channel decoding decoding Continue to decode the Interleavedchannel and maintaining the Composite Code Table

In various embodiments, the interleave and de-interleave functions areconfigured to act in coordination with each other. The interleave andde-interleave functions are each driven by a controller utilizing theinterleave and de-interleave specification and sequencing seeds.

In some embodiments, the gateway channel format and reformat functionsare configured to act in coordination with each other. The gatewaychannel format and reformat functions are each driven by the controllerutilizing the gateway channel format and reformat specification andsequencing seeds.

In some embodiments an error correcting code such a Bose, Chaudhuri,and/or Hocquenghem (BCH) code that generates additional bits that areadded uniquely to the data stream is included in the OCTS-expandedprocessing. By adding the use definition to each code, the E1 encodedvectors can be injected into the composite data stream in an arbitrarylocation, since they can be identified specifically as the generatedparity and error correction bits. In various embodiments, the input MUXand output DEMUX are configured to act in coordination with each other.The input MUX and the output DEMUX are each driven by the controllerutilizing the MUX/DEMUX specification and sequencing seeds.

In some embodiments, an OCTS-expanded communication system comprises acontroller. The controller is responsible for a series of tasks, suchas, for example quality of service monitoring and code table selectionto meet the needs of a dynamic transmission environment. The controllermay be further responsible for specifying, scheduling, and coordinatingcode table swaps, input remapping, multiplexer and de-multiplexeroperations, gateway channel formatting, and/or interleaved operations.In some embodiments, the controller is configured to receiveinformation, such as, for example, code table swap seeds, inputremapping seeds, multiplexer and de-multiplexer operation seeds, gatechannel formatting seeds, and/or interleaved operation seeds. Thereceived seeds may be generated from the code table generator seedscoded in the gateway channel.

In some embodiments, operational requirements for the controllercomprise monitoring the transmission environment and adapting to thetransmission environment and maintaining a sufficiently high rate oftable swapping to maintain signal integrity. The operationalrequirements may be driven by a specific application. The controllermanagement may be driven by a requirements matrix, an options matrixdefined by the system resources, and/or direct and indirect performanceand transmission environment measures. Direct performance andtransmission environment measures may comprise, for example, directquality of service measurements derived using code built into the codetable to calibrate against a known signal and receiver-uniquemeasurements. Indirect performance and transmission environment measuresmay comprise, for example, bit error rate derived from error controlcoding schemes, SNR estimate derived from miss distance measures used inthe decoding process, and/or rule in/rule out measure.

In some embodiments, an indirect performance and transmissionenvironment measure comprises rule in/rule out measure. An OCTS decodeprocess requires comparing the received decoded vector against all ofthe encoded vectors in a code table. In some embodiments, rather than anexhaustive search of the table, a rule in rule may be implemented. Arule in rule requires that if the MFED between the input vector and acode table vector is less than a predetermined value, the decoded vectoris immediately ruled in as the matching vector and the search can cease.In some embodiments, a rule out rule may be implemented. A rule out rulerequires that if the accumulated MFED calculated on a vectorelement-by-vector element basis exceeds a predetermined threshold, thecode table vector can be ruled out and the MFED calculation for thatvector can cease. In some embodiments, a derived measure is generated inthe case where no vector is ruled in, and all but a few vectors areruled out. In this embodiment, the vectors that are not ruled out arecorrelated to a signal to noise ratio and the proper match determined.

In some embodiments, the system design process is driven by requirementsoutlined in Table 2. The design outlined in Table 2 comprisesidentifying the operating range, prioritizing requirements, anddesigning a set of sequenced Code Tables that meet the requirements.

TABLE 2 System Design Driver Information Source/Drain Amount of DataTimeliness of Data Sensitivity of Data Computation Power Manageablesignal complexity Transmission Medium Public or Private System Uni or BiDirectional Fixed or Variable Transmission Environment Level ofTransmitter/Receiver Control Modulator Control Transmitter Power ControlReceiver Sensitivity Control Frequency, Channel, Mode Control BandwidthSignal Integrity Level of Exposure Time Value of InformationDesirability of Information-Transaction FinancialNational/Property/Personal Security Operations criticality Operationsdenial or misdirection Reliability requirements

FIG. 14 illustrates one embodiment of a computing device 900 which canbe used in one embodiment of the systems and methods for OCTS-expandedcommunication. For the sake of clarity, the computing device 900 isshown and described here in the context of a single computing device. Itis to be appreciated and understood, however, that any number ofsuitably configured computing devices can be used to implement any ofthe described embodiments. For example, in at least some implementation,multiple communicatively linked computing devices are used. One or moreof these devices can be communicatively linked in any suitable way suchas via one or more networks (LANs), one or more wide area networks(WANs), wireless connections, or any combination thereof.

In this example, the computing device 900 comprises one or moreprocessor circuits or processing units 902, on or more memory circuitsand/or storage circuit component(s) 904 and one or more input/output(I/O) circuit devices 906. Additionally, the computing device 900comprises a bus 908 that allows the various circuit components anddevices to communicate with one another. The bus 908 represents one ormore of any of several types of bus structures, including a memory busor local bus using any of a variety of bus architectures. The bus 908may comprise wired and/or wireless buses.

The processing unit 902 may be responsible for executing varioussoftware programs such as system programs, applications programs, and/ormodule to provide computing and processing operations for the computingdevice 900. The processing unit 902 may be responsible for performingvarious voice and data communications operations for the computingdevice 900 such as transmitting and receiving voice and data informationover one or more wired or wireless communication channels. Although theprocessing unit 902 of the computing device 900 includes singleprocessor architecture as shown, it may be appreciated that thecomputing device 900 may use any suitable processor architecture and/orany suitable number of processors in accordance with the describedembodiments. In one embodiment, the processing unit 900 may beimplemented using a single integrated processor.

The processing unit 902 may be implemented as a host central processingunit (CPU) using any suitable processor circuit or logic device(circuit), such as a as a general purpose processor. The processing unit902 also may be implemented as a chip multiprocessor (CMP), dedicatedprocessor, embedded processor, media processor, input/output (I/O)processor, co-processor, microprocessor, controller, microcontroller,application specific integrated circuit (ASIC), field programmable gatearray (FPGA), programmable logic device (PLD), or other processingdevice in accordance with the described embodiments.

As shown, the processing unit 902 may be coupled to the memory and/orstorage component(s) 904 through the bus 908. The memory bus 908 maycomprise any suitable interface and/or bus architecture for allowing theprocessing unit 902 to access the memory and/or storage component(s)904. Although the memory and/or storage component(s) 904 may be shown asbeing separate from the processing unit 902 for purposes ofillustration, it is worthy to note that in various embodiments someportion or the entire memory and/or storage component(s) 904 may beincluded on the same integrated circuit as the processing unit 902.Alternatively, some portion or the entire memory and/or storagecomponent(s) 904 may be implemented in an integrated circuit or othermedium (e.g., hard disk drive) external to the integrated circuit of theprocessing unit 902. In various embodiments, the computing device 900may comprise an expansion slot to support a multimedia and/or memorycard, for example.

The memory and/or storage component(s) 904 represent one or morecomputer-readable media. The memory and/or storage component(s) 904 maybe implemented using any computer-readable media capable of storing datasuch as volatile or non-volatile memory, removable or non-removablememory, erasable or non-erasable memory, writeable or re-writeablememory, and so forth. The memory and/or storage component(s) 904 maycomprise volatile media (e.g., random access memory (RAM)) and/ornonvolatile media (e.g., read only memory (ROM), Flash memory, opticaldisks, magnetic disks and the like). The memory and/or storagecomponent(s) 904 may comprise fixed media (e.g., RAM, ROM, a fixed harddrive, etc.) as well as removable media (e.g., a Flash memory drive, aremovable hard drive, an optical disk, etc.). Examples ofcomputer-readable storage media may include, without limitation, RAM,dynamic RAM (DRAM), Double-Data-Rate DRAM (DDRAM), synchronous DRAM(SDRAM), static RAM (SRAM), read-only memory (ROM), programmable ROM(PROM), erasable programmable ROM (EPROM), electrically erasableprogrammable ROM (EEPROM), flash memory (e.g., NOR or NAND flashmemory), content addressable memory (CAM), polymer memory (e.g.,ferroelectric polymer memory), phase-change memory, ovonic memory,ferroelectric memory, silicon-oxide-nitride-oxide-silicon (SONOS)memory, magnetic or optical cards, or any other type of media suitablefor storing information.

The one or more I/O devices 906 allow a user to enter commands andinformation to the computing device 900, and also allow information tobe presented to the user and/or other components or devices. Examples ofinput devices include a keyboard, a cursor control device (e.g., amouse), a microphone, a scanner and the like. Examples of output devicesinclude a display device (e.g., a monitor or projector, speakers, aprinter, a network card, etc.). The computing device 900 may comprise analphanumeric keypad coupled to the processing unit 902. The keypad maycomprise, for example, a QWERTY key layout and an integrated number dialpad. The computing device 900 may comprise a display coupled to theprocessing unit 902. The display may comprise any suitable visualinterface for displaying content to a user of the computing device 900.In one embodiment, for example, the display may be implemented by aliquid crystal display (LCD) such as a touch-sensitive color (e.g.,76-bit color) thin-film transistor (TFT) LCD screen. The touch-sensitiveLCD may be used with a stylus and/or a handwriting recognizer program.

The processing unit 902 may be arranged to provide processing orcomputing resources to the computing device 900. For example, theprocessing unit 902 may be responsible for executing various softwareprograms including system programs such as operating system (OS) andapplication programs. System programs generally may assist in therunning of the computing device 900 and may be directly responsible forcontrolling, integrating, and managing the individual hardwarecomponents of the computer system. The OS may be implemented, forexample, as a Microsoft® Windows OS, Symbian OS™, Embedix OS, Linux OS,Binary Run-time Environment for Wireless (BREW) OS, JavaOS, Android OS,Apple OS or other suitable OS in accordance with the describedembodiments. The computing device 900 may comprise other system programssuch as device drivers, programming tools, utility programs, softwarelibraries, application programming interfaces (APIs), and so forth.

The computer 900 also includes a network interface 910 coupled to thebus 908. The network interface 910 provides a two-way data communicationcoupling to a local network 912. For example, the network interface 910may be a digital subscriber line (DSL) modem, satellite dish, anintegrated services digital network (ISDN) card or other datacommunication connection to a corresponding type of telephone line. Asanother example, the communication interface 910 may be a local areanetwork (LAN) card effecting a data communication connection to acompatible LAN. Wireless communication means such as internal orexternal wireless modems may also be implemented.

In any such implementation, the network interface 910 sends and receiveselectrical, electromagnetic or optical signals that carry digital datastreams representing various types of information, such as the selectionof goods to be purchased, the information for payment of the purchase,or the address for delivery of the goods. The network interface 910typically provides data communication through one or more networks toother data devices. For example, the network interface 910 may effect aconnection through the local network to an Internet Service Provider(ISP) or to data equipment operated by an ISP. The ISP in turn providesdata communication services through the internet (or other packet-basedwide area network). The local network and the internet both useelectrical, electromagnetic or optical signals that carry digital datastreams. The signals through the various networks and the signals on thenetwork interface 910, which carry the digital data to and from thecomputer system 900, are exemplary forms of carrier waves transportingthe information.

The computer 900 can send messages and receive data, including programcode, through the network(s) and the network interface 910. In theInternet example, a server might transmit a requested code for anapplication program through the internet, the ISP, the local network(the network 912) and the network interface 910. In accordance with theinvention, one such downloaded application provides for theidentification and analysis of a prospect pool and analysis of marketingmetrics. The received code may be executed by processor 904 as it isreceived, and/or stored in storage device 904, or other non-volatilestorage for later execution. In this manner, computer 900 may obtainapplication code in the form of a carrier wave.

Various embodiments may be described herein in the general context ofcomputer executable instructions, such as software, program modules,and/or engines being executed by a computer. Generally, software,program modules, and/or engines include any software element arranged toperform particular operations or implement particular abstract datatypes. Software, program modules, and/or engines can include routines,programs, objects, components, data structures and the like that performparticular tasks or implement particular abstract data types. Animplementation of the software, program modules, and/or enginescomponents and techniques may be stored on and/or transmitted acrosssome form of computer-readable media. In this regard, computer-readablemedia can be any available medium or media useable to store informationand accessible by a computing device. Some embodiments also may bepracticed in distributed computing environments where operations areperformed by one or more remote processing devices that are linkedthrough a communications network. In a distributed computingenvironment, software, program modules, and/or engines may be located inboth local and remote computer storage media including memory storagedevices.

Although some embodiments may be illustrated and described as comprisingfunctional components, software, engines, and/or modules performingvarious operations, it can be appreciated that such components ormodules may be implemented by one or more hardware components, softwarecomponents, and/or combination thereof. The functional components,software, engines, and/or modules may be implemented, for example, bylogic (e.g., instructions, data, and/or code) to be executed by a logicdevice (e.g., processor). Such logic may be stored internally orexternally to a logic device on one or more types of computer-readablestorage media. In other embodiments, the functional components such assoftware, engines, and/or modules may be implemented by hardwareelements that may include processors, microprocessors, circuits, circuitelements (e.g., transistors, resistors, capacitors, inductors, and soforth), integrated circuits, application specific integrated circuits(ASIC), programmable logic devices (PLD), digital signal processors(DSP), field programmable gate array (FPGA), logic gates, registers,semiconductor device, chips, microchips, chip sets, and so forth.

Examples of software, engines, and/or modules may include softwarecomponents, programs, applications, computer programs, applicationprograms, system programs, machine programs, operating system software,middleware, firmware, software modules, routines, subroutines,functions, methods, procedures, software interfaces, application programinterfaces (API), instruction sets, computing code, computer code, codesegments, computer code segments, words, values, symbols, or anycombination thereof. Determining whether an embodiment is implementedusing hardware elements and/or software elements may vary in accordancewith any number of factors, such as desired computational rate, powerlevels, heat tolerances, processing cycle budget, input data rates,output data rates, memory resources, data bus speeds and other design orperformance constraints.

In some cases, various embodiments may be implemented as an article ofmanufacture. The article of manufacture may include a computer readablestorage medium arranged to store logic, instructions and/or data forperforming various operations of one or more embodiments. In variousembodiments, for example, the article of manufacture may comprise amagnetic disk, optical disk, flash memory or firmware containingcomputer program instructions suitable for execution by a generalpurpose processor or application specific processor. The embodiments,however, are not limited in this context.

While various details have been set forth in the foregoing description,it will be appreciated that the various embodiments of the apparatus,system, and method for anonymous sharing and public vetting of contentmay be practiced without these specific details. For example, forconciseness and clarity selected aspects have been shown in blockdiagram form rather than in detail. Some portions of the detaileddescriptions provided herein may be presented in terms of instructionsthat operate on data that is stored in a computer memory. Suchdescriptions and representations are used by those skilled in the art todescribe and convey the substance of their work to others skilled in theart. In general, an algorithm refers to a self-consistent sequence ofsteps leading to a desired result, where a “step” refers to amanipulation of physical quantities which may, though need notnecessarily, take the form of electrical or magnetic signals capable ofbeing stored, transferred, combined, compared, and otherwisemanipulated. It is common usage to refer to these signals as bits,values, elements, symbols, characters, terms, numbers, or the like.These and similar terms may be associated with the appropriate physicalquantities and are merely convenient labels applied to these quantities.

Unless specifically stated otherwise as apparent from the foregoingdiscussion, it is appreciated that, throughout the foregoingdescription, discussions using terms such as “processing” or “computing”or “calculating” or “determining” or “displaying” or the like, refer tothe action and processes of a computer system, or similar electroniccomputing device, that manipulates and transforms data represented asphysical (electronic) quantities within the computer system's registersand memories into other data similarly represented as physicalquantities within the computer system memories or registers or othersuch information storage, transmission or display devices.

It is worthy to note that any reference to “one aspect,” “an aspect,”“one embodiment,” or “an embodiment” means that a particular feature,structure, or characteristic described in connection with the aspect isincluded in at least one aspect. Thus, appearances of the phrases “inone aspect,” “in an aspect,” “in one embodiment,” or “in an embodiment”in various places throughout the specification are not necessarily allreferring to the same aspect. Furthermore, the particular features,structures or characteristics may be combined in any suitable manner inone or more aspects.

Although various embodiments have been described herein, manymodifications, variations, substitutions, changes, and equivalents tothose embodiments may be implemented and will occur to those skilled inthe art. Also, where materials are disclosed for certain components,other materials may be used. It is therefore to be understood that theforegoing description and the appended claims are intended to cover allsuch modifications and variations as falling within the scope of thedisclosed embodiments. The following claims are intended to cover allsuch modification and variations.

In summary, numerous benefits have been described which result fromemploying the concepts described herein. The foregoing description ofthe one or more embodiments has been presented for purposes ofillustration and description. It is not intended to be exhaustive orlimiting to the precise form disclosed. Modifications or variations arepossible in light of the above teachings. The one or more embodimentswere chosen and described in order to illustrate principles andpractical application to thereby enable one of ordinary skill in the artto utilize the various embodiments and with various modifications as aresuited to the particular use contemplated. It is intended that theclaims submitted herewith define the overall scope.

Some or all of the embodiments described herein may generally comprisetechnologies which can be implemented, individually, and/orcollectively, by a wide range of hardware, software, firmware, or anycombination thereof can be viewed as being composed of various types of“electrical circuitry.” Consequently, as used herein “electricalcircuitry” includes, but is not limited to, electrical circuitry havingat least one discrete electrical circuit, electrical circuitry having atleast one integrated circuit, electrical circuitry having at least oneapplication specific integrated circuit, electrical circuitry forming ageneral purpose computing device configured by a computer program (e.g.,a general purpose computer configured by a computer program which atleast partially carries out processes and/or devices described herein,or a microprocessor configured by a computer program which at leastpartially carries out processes and/or devices described herein),electrical circuitry forming a memory device (e.g., forms of randomaccess memory), and/or electrical circuitry forming a communicationsdevice (e.g., a modem, communications switch, or optical-electricalequipment). Those having skill in the art will recognize that thesubject matter described herein may be implemented in an analog ordigital fashion or some combination thereof.

The foregoing detailed description has set forth various embodiments ofthe devices and/or processes via the use of block diagrams, flowcharts,and/or examples. Insofar as such block diagrams, flowcharts, and/orexamples contain one or more functions and/or operations, it will beunderstood by those within the art that each function and/or operationwithin such block diagrams, flowcharts, or examples can be implemented,individually and/or collectively, by a wide range of hardware, software,firmware, or virtually any combination thereof. In one embodiment,several portions of the subject matter described herein may beimplemented via Application Specific Integrated Circuits (ASICs), FieldProgrammable Gate Arrays (FPGAs), digital signal processors (DSPs), orother integrated formats. However, those skilled in the art willrecognize that some aspects of the embodiments disclosed herein, inwhole or in part, can be equivalently implemented in integratedcircuits, as one or more computer programs running on one or morecomputers (e.g., as one or more programs running on one or more computersystems), as one or more programs running on one or more processors(e.g., as one or more programs running on one or more microprocessors),as firmware, or as virtually any combination thereof, and that designingthe circuitry and/or writing the code for the software and or firmwarewould be well within the skill of one of skill in the art in light ofthis disclosure. In addition, those skilled in the art will appreciatethat the mechanisms of the subject matter described herein are capableof being distributed as a program product in a variety of forms, andthat an illustrative embodiment of the subject matter described hereinapplies regardless of the particular type of signal bearing medium usedto actually carry out the distribution. Examples of a signal bearingmedium include, but are not limited to, the following: a recordable typemedium such as a floppy disk, a hard disk drive, a Compact Disc (CD), aDigital Video Disk (DVD), a digital tape, a computer memory, etc.; and atransmission type medium such as a digital and/or an analogcommunication medium (e.g., a fiber optic cable, a waveguide, a wiredcommunications link, a wireless communication link (e.g., transmitter,receiver, transmission logic, reception logic, etc.), etc.).

One skilled in the art will recognize that the herein describedcomponents (e.g., operations), devices, objects, and the discussionaccompanying them are used as examples for the sake of conceptualclarity and that various configuration modifications are contemplated.Consequently, as used herein, the specific exemplars set forth and theaccompanying discussion are intended to be representative of their moregeneral classes. In general, use of any specific exemplar is intended tobe representative of its class, and the non-inclusion of specificcomponents (e.g., operations), devices, and objects should not be takenlimiting.

With respect to the use of substantially any plural and/or singularterms herein, those having skill in the art can translate from theplural to the singular and/or from the singular to the plural as isappropriate to the context and/or application. The varioussingular/plural permutations are not expressly set forth herein for sakeof clarity.

The herein described subject matter sometimes illustrates differentcomponents contained within, or connected with, different othercomponents. It is to be understood that such depicted architectures aremerely exemplary, and that in fact many other architectures may beimplemented which achieve the same functionality. In a conceptual sense,any arrangement of components to achieve the same functionality iseffectively “associated” such that the desired functionality isachieved. Hence, any two components herein combined to achieve aparticular functionality can be seen as “associated with” each othersuch that the desired functionality is achieved, irrespective ofarchitectures or intermedial components. Likewise, any two components soassociated can also be viewed as being “operably connected,” or“operably coupled,” to each other to achieve the desired functionality,and any two components capable of being so associated can also be viewedas being “operably couplable,” to each other to achieve the desiredfunctionality. Specific examples of operably couplable include but arenot limited to physically mateable and/or physically interactingcomponents, and/or wirelessly interactable, and/or wirelesslyinteracting components, and/or logically interacting, and/or logicallyinteractable components.

In some instances, one or more components may be referred to herein as“configured to,” “configurable to,” “operable/operative to,”“adapted/adaptable,” “able to,” “conformable/conformed to,” etc. Thoseskilled in the art will recognize that “configured to” can generallyencompass active-state components and/or inactive-state componentsand/or standby-state components, unless context requires otherwise.

While particular aspects of the present subject matter described hereinhave been shown and described, it will be apparent to those skilled inthe art that, based upon the teachings herein, changes and modificationsmay be made without departing from the subject matter described hereinand its broader aspects and, therefore, the appended claims are toencompass within their scope all such changes and modifications as arewithin the true spirit and scope of the subject matter described herein.It will be understood by those within the art that, in general, termsused herein, and especially in the appended claims (e.g., bodies of theappended claims) are generally intended as “open” terms (e.g., the term“including” should be interpreted as “including but not limited to,” theterm “having” should be interpreted as “having at least,” the term“includes” should be interpreted as “includes but is not limited to,”etc.). It will be further understood by those within the art that if aspecific number of an introduced claim recitation is intended, such anintent will be explicitly recited in the claim, and in the absence ofsuch recitation no such intent is present. For example, as an aid tounderstanding, the following appended claims may contain usage of theintroductory phrases “at least one” and “one or more” to introduce claimrecitations. However, the use of such phrases should not be construed toimply that the introduction of a claim recitation by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim recitation to claims containing only one suchrecitation, even when the same claim includes the introductory phrases“one or more” or “at least one” and indefinite articles such as “a” or“an” (e.g., “a” and/or “an” should typically be interpreted to mean “atleast one” or “one or more”); the same holds true for the use ofdefinite articles used to introduce claim recitations.

In addition, even if a specific number of an introduced claim recitationis explicitly recited, those skilled in the art will recognize that suchrecitation should typically be interpreted to mean at least the recitednumber (e.g., the bare recitation of “two recitations,” without othermodifiers, typically means at least two recitations, or two or morerecitations). Furthermore, in those instances where a conventionanalogous to “at least one of A, B, and C, etc.” is used, in generalsuch a construction is intended in the sense one having skill in the artwould understand the convention (e.g., “a system having at least one ofA, B, and C” would include but not be limited to systems that have Aalone, B alone, C alone, A and B together, A and C together, B and Ctogether, and/or A, B, and C together, etc.). In those instances where aconvention analogous to “at least one of A, B, or C, etc.” is used, ingeneral such a construction is intended in the sense one having skill inthe art would understand the convention (e.g., “a system having at leastone of A, B, or C” would include but not be limited to systems that haveA alone, B alone, C alone, A and B together, A and C together, B and Ctogether, and/or A, B, and C together, etc.). It will be furtherunderstood by those within the art that typically a disjunctive wordand/or phrase presenting two or more alternative terms, whether in thedescription, claims, or drawings, should be understood to contemplatethe possibilities of including one of the terms, either of the terms, orboth terms unless context dictates otherwise. For example, the phrase “Aor B” will be typically understood to include the possibilities of “A”or “B” or “A and B.”

With respect to the appended claims, those skilled in the art willappreciate that recited operations therein may generally be performed inany order. Also, although various operational flows are presented in asequence(s), it should be understood that the various operations may beperformed in other orders than those which are illustrated, or may beperformed concurrently. Examples of such alternate orderings may includeoverlapping, interleaved, interrupted, reordered, incremental,preparatory, supplemental, simultaneous, reverse, or other variantorderings, unless context dictates otherwise. Furthermore, terms like“responsive to,” “related to,” or other past-tense adjectives aregenerally not intended to exclude such variants, unless context dictatesotherwise.

Those skilled in the art will recognize that it is common within the artto implement devices and/or processes and/or systems, and thereafter useengineering and/or other practices to integrate such implemented devicesand/or processes and/or systems into more comprehensive devices and/orprocesses and/or systems. That is, at least a portion of the devicesand/or processes and/or systems described herein can be integrated intoother devices and/or processes and/or systems via a reasonable amount ofexperimentation. Those having skill in the art will recognize thatexamples of such other devices and/or processes and/or systems mightinclude—as appropriate to context and application—all or part of devicesand/or processes and/or systems of (a) an air conveyance (e.g., anairplane, rocket, helicopter, etc.), (b) a ground conveyance (e.g., acar, truck, locomotive, tank, armored personnel carrier, etc.), (c) abuilding (e.g., a home, warehouse, office, etc.), (d) an appliance(e.g., a refrigerator, a washing machine, a dryer, etc.), (e) acommunications system (e.g., a networked system, a telephone system, aVoice over IP system, etc.), (f) a business entity (e.g., an InternetService Provider (ISP) entity such as Comcast Cable, Qwest, SouthwesternBell, etc.), or (g) a wired/wireless services entity (e.g., Sprint,Cingular, Nextel, etc.), etc.

In certain cases, use of a system or method may occur in a territoryeven if components are located outside the territory. For example, in adistributed computing context, use of a distributed computing system mayoccur in a territory even though parts of the system may be locatedoutside of the territory (e.g., relay, server, processor, signal-bearingmedium, transmitting computer, receiving computer, etc. located outsidethe territory).

A sale of a system or method may likewise occur in a territory even ifcomponents of the system or method are located and/or used outside theterritory. Further, implementation of at least part of a system forperforming a method in one territory does not preclude use of the systemin another territory.

In summary, numerous benefits have been described which result fromemploying the concepts described herein. The foregoing description ofthe one or more embodiments has been presented for purposes ofillustration and description. It is not intended to be exhaustive orlimiting to the precise form disclosed. Modifications or variations arepossible in light of the above teachings. The one or more embodimentswere chosen and described in order to illustrate principles andpractical application to thereby enable one of ordinary skill in the artto utilize the various embodiments and with various modifications as aresuited to the particular use contemplated. It is intended that theclaims submitted herewith define the overall scope.

Various aspects of the subject matter described herein are set out inthe following numbered clauses:

1. A computer-implemented method comprising: receiving, by a processor,a digital bit stream; transforming, by the processor, the digital bitstream to an encoded digital bit stream, wherein the encoded digital bitstream comprises at least one of a gateway channel, a composite channel,or a data channel, and any combination thereof; providing, by theprocessor, the encoded digital bit stream to a transmission system fortransmission; and establishing, by the processor, signal integrity byutilizing pre-coordinated, pre-distributed information to limit thetransmission to an intended sender-receiver pair, wherein the intendedsender-receiver pair comprises the pre-coordinated, pre-distributedinformation.

2. The computer-implemented method of claim 1, comprising maintaining,by the processor, the signal integrity by utilizing the pre-coordinated,pre-distributed information.

3. The computer-implemented method of claim 1, comprising limiting, bythe processor, the transmission to the intended sender and receiver byuniquely formatting the encoded digital bit stream prior totransmission.

4. The computer-implemented method of claim 1, wherein transforming thedigital bit stream comprises applying, by the processor, an m-elementvector table to the digital bit stream.

5. The computer-implemented method of claim 4, wherein applying them-element vector table to the digital bit stream comprises performing,by the processor, a table lookup for the digital bit stream.

6. The computer-implemented method of claim 4, wherein applying them-element vector table to the digital bit stream comprises mapping, bythe processor, the m-element table to the digital bit stream accordingto a mapping function.

7. The computer-implemented method of claim 1, comprising employing, bythe processor, the m-element vector table to manage at least one of abit error rate (BER), realized data throughput, bit energy, or signalrange, and any combination thereof, to provide enhanced signal integrityand communication.

8. The computer-implemented method of claim 1, comprising managing, bythe processor, one or more tasks to enhance signal integrity andcommunication to provide an industry-standards agnostic interface to anexisting digital communications system.

9. The computer-implemented method of claim 1, comprising, interleaving,by the processor, a data vector and the composite channel utilizing thegateway channel and a gateway mask.

10. The computer-implemented method of claim 1, comprising: generating,by the processor, a plurality of additional bits, wherein the pluralityof additional bits are generated by error correcting code; and adding,by the processor, the plurality of additional bits to the encodeddigital bit stream.

11. The computer-implemented method of claim 1, comprising implementing,by the processor, at least one of bit position partitioning, tablepartitioning, or a combination thereof, to generate blended partitioningfor the m-element vector table to enhance signal integrity andcommunication

12. A system comprising: a communications interface; a processor; and anon-transient memory medium operatively coupled to the processor,wherein the memory medium is configured to store a plurality ofinstructions configured to program the processor to: receive a digitalbit stream; transform the digital bit stream to an encoded digital bitstream, wherein the encoded digital bit stream comprises at least one ofa gateway channel, a composite channel, or a data channel, and anycombination thereof; provide the encoded digital bit stream to thecommunications interface for transmission; and establish signalintegrity by utilizing pre-coordinated, pre-distributed information tolimit the transmission to an intended sender-receiver pair, wherein theintended sender-receiver pair comprises the pre-coordinated,pre-distributed information.

13. The computer-implemented method of claim 12, wherein the processoris further configured to maintain the signal integrity by utilizing thepre-coordinated, pre-distributed information.

14. The computer-implemented method of claim 12, wherein the processoris further configured to limit the transmission to the intended senderand receiver by uniquely formatting the encoded digital bit stream priorto transmission.

15. The system of claim 12, wherein transforming the digital bit streamcomprises applying an m-element vector table to the digital bit stream.

16. The system of claim 12, wherein the processor is further configuredto employ the m-element vector table to manage at least one of a biterror rate (BER), realized data throughput, bit energy, or signal range,and any combination thereof, to provide enhanced signal integrity andcommunication.

17. The system of claim 12, wherein the processor is further configuredto manage one or more tasks to enhance signal integrity andcommunication to provide an industry-standards agnostic interface to anexisting digital communications system.

18. The system of claim 12, wherein the processor is further configuredto: generate a plurality of additional bits, wherein the plurality ofadditional bits are generated by error correcting code; and add theplurality of additional bits to the encoded digital bit stream.

19. The system of claim 12, wherein the communications interfacecomprises a bound communication system.

20. The system of claim 12, wherein the communications interfacecomprises an unbound communication system.

21. A non-transitory computer-readable memory medium configured to storeinstructions thereon that when loaded by a processor cause the processorto: receive a digital bit stream; transform the digital bit stream to anencoded digital bit stream, wherein the encoded digital bit streamcomprises at least one of a gateway channel, a composite channel, or adata channel, and any combination thereof; provide the encoded digitalbit stream to the communications interface for transmission; establishsignal integrity by utilizing pre-coordinated, pre-distributedinformation to limit the transmission to an intended sender-receiverpair, wherein the intended sender-receiver pair comprises thepre-coordinated, pre-distributed information; maintain the signalintegrity by utilizing the pre-coordinated, pre-distributed information;and limit the transmission to the intended sender and receiver byuniquely formatting the encoded digital bit stream prior totransmission.

1-21. (canceled)
 22. A computer-implemented method comprising:receiving, by a processor, a digital bit stream; transforming, by theprocessor, the digital bit stream to an encoded digital bit stream,wherein the encoded digital bit stream comprises a gateway partition,and at least one of a composite partition, or a data partition, or anycombination thereof, wherein the gateway partition provides a uniqueformatting function and identifies a configuration for the compositepartition, and wherein the gateway partition provides a multi-partmessage comprising a first part to provide the unique formattingfunction and a second part to identify the current composite partitionconfiguration; providing, by the processor, the encoded digital bitstream to a transmission system for transmission; and establishing, bythe processor, the unique formatting function by utilizingpre-coordinated, pre-distributed information to limit a digital bitstream to an intended sender-receiver pair, wherein the intendedsender-receiver pair comprises the pre-coordinated, pre-distributedinformation.
 23. The computer-implemented method of claim 22, comprisingmaintaining, by the processor, the unique formatting function byutilizing the pre-coordinated, pre-distributed information.
 24. Thecomputer-implemented method of claim 22, comprising limiting, by theprocessor, the transmission to the intended sender and receiver byuniquely formatting the encoded digital bit stream prior totransmission.
 25. The computer-implemented method of claim 24, whereinuniquely formatting the encoded digital bit stream comprises applying,by the processor, an m-element vector table to the digital bit stream.26. The computer-implemented method of claim 25, wherein applying them-element vector table to the digital bit stream comprises performing,by the processor, a table lookup for the digital bit stream.
 27. Thecomputer-implemented method of claim 25, wherein applying the m-elementvector table to the digital bit stream comprises mapping, by theprocessor, the m-element table to the encoded digital bit streamaccording to a mapping function.
 28. The computer-implemented method ofclaim 25, comprising employing, by the processor, the m-element vectortable to manage at least one of a bit error rate (BER), realized datathroughput, bit energy, or signal range, or any combination thereof, toprovide a seed for encoding the digital bit stream by the uniqueformatting function.
 29. The computer-implemented method of claim 22,comprising managing, by the processor, one or more tasks to encode bythe unique formatting function to provide an industry-standards agnosticinterface to an existing digital communications system.
 30. Thecomputer-implemented method of claim 22, comprising, interleaving, bythe processor, a data vector and the composite channel utilizing thegateway channel and a gateway mask.
 31. The computer-implemented methodof claim 22, comprising: generating, by the processor, a plurality ofadditional bits, wherein the plurality of additional bits are generatedby error correcting code; and adding, by the processor, the plurality ofadditional bits to the encoded digital bit stream by the uniqueformatting function.
 32. The computer-implemented method of claim 25,comprising implementing, by the processor, at least one of bit positionpartitioning, table partitioning, or a combination thereof, to generateblended partitioning for the m-element vector table to enhance theencoded digital bit stream by the unique formatting function.
 33. Asystem comprising: a communications interface; a processor; and anon-transient memory medium operatively coupled to the processor,wherein the memory medium is configured to store a plurality ofinstructions configured to program the processor to: receive a digitalbit stream; transform the digital bit stream to an encoded digital bitstream, wherein the encoded digital bit stream comprises a gatewaypartition, and at least one of a composite partition, or a datapartition, or any combination thereof, wherein the gateway partitionprovides a unique formatting function and identifies a configuration forthe composite partition, and wherein the gateway partition provides amulti-part message comprising a first part to provide the uniqueformatting function and a second part to identify the current compositepartition configuration; provide the encoded digital bit stream to thecommunications interface for transmission; and establish the uniqueformatting function by utilizing pre-coordinated, pre-distributedinformation to limit decoding of the encoded digital bit stream to anintended sender-receiver pair, wherein the intended sender-receiver paircomprises the pre-coordinated, pre-distributed information.
 34. Thecomputer-implemented method of claim 33, wherein the processor isfurther configured to maintain the unique formatting function byutilizing the pre-coordinated, pre-distributed information.
 35. Thecomputer-implemented method of claim 33, wherein the processor isfurther configured to limit the unique formatting function to theintended sender and receiver by uniquely formatting the encoded digitalbit stream prior to transmission.
 36. The system of claim 33, whereinthe unique formatting function comprises applying an m-element vectortable to the digital bit stream.
 37. The system of claim 33, wherein theprocessor is further configured to employ the m-element vector table tomanage at least one of a bit error rate (BER), realized data throughput,bit energy, or signal range, or any combination thereof, to provide aseed for encoding the digital bit stream by the unique formattingfunction.
 38. The system of claim 33, wherein the processor is furtherconfigured to manage one or more tasks to encode by the uniqueformatting function to provide an industry-standards agnostic interfaceto an existing digital communications system.
 39. The system of claim33, wherein the processor is further configured to: generate a pluralityof additional bits, wherein the plurality of additional bits aregenerated by error correcting code; and add the plurality of additionalbits to the encoded bit stream by the unique formatting function. 40.The system of claim 33, wherein the unique formatting functioncommunications interface comprises a bound communication system.
 41. Thesystem of claim 33, wherein the unique formatting functioncommunications interface comprises an unbound communication system. 42.A non-transitory computer-readable memory medium configured to storeinstructions thereon that when loaded by a processor cause the processorto: receive a digital bit stream; transform the digital bit stream to anencoded digital bit stream, wherein the encoded digital stream comprisesa gateway partition, and at least one of a composite partition, or adata partition, or any combination thereof, wherein the gatewaypartition provides a unique formatting function and identifies aconfiguration for the composite partition, and wherein the gatewaypartition provides a multi-part message comprising a first part toprovide the unique formatting function and a second part to identify thecurrent composite partition configuration; provide the encoded digitalbit stream to the non-standard cryptography communications interface fortransmission; establish the unique formatting function by utilizingpre-coordinated, pre-distributed information to limit the decodingdigital bit stream to an intended sender-receiver pair, wherein theintended sender-receiver pair comprises the pre-coordinated,pre-distributed information; and maintain the unique formatting functionby utilizing the pre-coordinated, pre-distributed information; or limitthe decoding of the digital bit stream to the intended sender andreceiver by uniquely formatting the encoded digital bit stream.